Non-Associative Parallel Prefix Computation

نویسندگان

Rong-Jaye Chen

Yu-Song Hou

چکیده

Chen, R.-J. and Y.-S. Hou, Non-associative parallel prefix computation, Information Processing Letters 44 (1992) 91-94. Associativity of a binary operation allows many applications that are not possible with a non-associative binary operation. We propose a method to transform a binary expression into an associative one and present two related applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Depth-Size Trade-Offs for Parallel Prefix Computation

A prefix circuit has n inputs xi, . , x, , and computes the n outputs xi 0 . . . 0 xi, i=l , . . , n, where 0 is an associative operation. It is shown that the depth t and the size s of parallel prefix circuits are related by the inequality t + s 2 2n 2. This is true even if arbitrary binary operations can be performed at each node. For 2lgn-2<t<n-loptimalcircuitswith t+s=2n-2arebuilt.Thedepth ...

متن کامل

Parallel Algorithms for Computing Linked List Prefix

Given a linked list x1, x2, ..., xn with xi following xi−1 in the list and an associative operation ©, the linked list prefix problem is to compute all prefixes ©ji=1xi, j = 1, 2, ..., n. In this paper we study the linked list prefix problem on parallel computation models. A deterministic algorithm for computing a linked list prefix on a completely connected parallel computation model is obtain...

متن کامل

Functional and dynamic programming in the design of parallel prefix networks

A parallel prefix network computes each x0 ◦ x1 ◦ . . . xk for 0 ≤ k < n, for an associative operator ◦. This is one of the fundamental problems in computer science, because it gives insight into how parallel computation can be used to solve an apparently sequential problem. As parallel programming becomes the dominant programming paradigm, parallel prefix or scan is proving to be a very import...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل